Graph Embeddability with Constrained Reachability
نویسندگان
چکیده
Given a transitive directed reachability graph G and a target structure S, we are interested in whether or not we can create an embedding of G in S. Definition: A Steiner point is a vertex s in S that does not correspond to any vertex v in G.
منابع مشابه
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, it may be required that a node reaches a particular set of nodes by respecting some restrictions like visiting a particular set of nodes or edges and using less than a certain amount of resources. The reachability constr...
متن کاملFormal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
We show interreducibility under (Turing) reductions of low polynomial degree between three families of problems parametrised by classes of formal languages: the problem of reachability in a directed graph constrained by a formal language, the problem of deciding whether or not the intersection of a language of some class with a regular language is empty, and the model checking problem for Propo...
متن کاملUsing Dominators for Solving Constrained Path Problems
Constrained path problems have to do with finding paths in graphs subject to constraints. We present a constraint programming approach for solving the Ordered disjoint-paths problem (ODP), i.e., the Disjoint-paths problem where the pairs are associated with ordering constraints. In our approach, we reduce ODP to the Ordered simple path with mandatory nodes problem (OSPMN), i.e., the problem of ...
متن کاملBitPath – Label Order Constrained Reachability Queries for Large RDF Graphs
In this paper we focus on the following constrained reachability problem over edge-labeled graphs like RDF – given source node x, destination node y, and a sequence of edge labels (a, b, c, d), is there a path between the two nodes such that the edge labels on the path satisfy a regular expression “*a.*b.*c.*d.*”. A “*” before “a” allows any other edge label to appear on the path before edge “a...
متن کاملReachability and Boundedness in Time-Constrained MSC Graphs∗
Channel boundedness is a necessary condition for a message-passing system to exhibit regular, finite-state behaviour at the global level. For Message Sequence Graphs (MSGs), the most basic form of Highlevel Message Sequence Charts (HMSCs), channel boundedness can be characterized in terms of structural conditions on the underlying graph. We consider MSGs enriched with timing constraints between...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008